-
1 deducible theorem
Большой англо-русский и русско-английский словарь > deducible theorem
-
2 deducible theorem
Математика: выводимая теорема -
3 deducible theorem
мат. -
4 formally deducible theorem
Математика: формально выводимая теоремаУниверсальный англо-русский словарь > formally deducible theorem
-
5 formally deducible theorem
English-Russian scientific dictionary > formally deducible theorem
-
6 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
7 deducible
выводимый formally deducible theorem ≈ формально выводимая теорема - deducible formula - deducible rule - deducible rules - deducible sentence - deducible theorem( from) выводимыйБольшой англо-русский и русско-английский словарь > deducible
-
8 deducible
-
9 выводимая теорема
Большой англо-русский и русско-английский словарь > выводимая теорема
См. также в других словарях:
Deduction theorem — In mathematical logic, the deduction theorem is a metatheorem of first order logic.[1] It is a formalization of the common proof technique in which an implication A → B is proved by assuming A and then proving B from this assumption.… … Wikipedia
Agda (theorem prover) — Agda is a theorem prover, i.e. a computer program that can check mathematical proofs. More specifically, it is an interactive system for developing constructive proofs in a variant of Per Martin Löf s Type Theory. It can also be seen as a… … Wikipedia
Bernard Bolzano — Bernard (Bernhard) Placidus Johann Nepomuk Bolzano (birth date|1781|10|5|mf=y ndash; December 18, 1848) was a Bohemian mathematician, theologian, philosopher, logician and antimilitarist of German mother tongue.FamilyBolzano was the son of two… … Wikipedia
History of logic — Philosophy ( … Wikipedia
Heyting algebra — In mathematics, Heyting algebras are special partially ordered sets that constitute a generalization of Boolean algebras, named after Arend Heyting. Heyting algebras arise as models of intuitionistic logic, a logic in which the law of excluded… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium
Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… … Wikipedia
Demostración automática de teoremas — Saltar a navegación, búsqueda Para otros usos de este término, véase Demostración. La demostración automática de teoremas (de siglas ATP, por el término en inglés … Wikipedia Español
Curry-Howard correspondence — The Curry Howard correspondence is the direct relationship between computer programs and mathematical proofs. Also known as Curry Howard isomorphism, proofs as programs correspondence and formulae as types correspondence, it refers to the… … Wikipedia
Logicism — is one of the schools of thought in the philosophy of mathematics, putting forth the theory that mathematics is an extension of logic and therefore some or all mathematics is reducible to logic.[1] Bertrand Russell and Alfred North Whitehead… … Wikipedia
Entailment — For other uses, see Entail (disambiguation). In logic, entailment is a relation between a set of sentences (e.g.,[1] meaningfully declarative sentences or truthbearers) and a sentence. Let Γ be a set of one or more sentences; let S1 be the… … Wikipedia